Sharp bounds in stochastic network calculus
نویسندگان
چکیده
منابع مشابه
On Stochastic Network Calculus
This research is to develop a new form of stochastic network calculus for queuing system performance guarantees by making use of the Legendre transform at the sample-path level. A symmetrical formulation is resulted in through separate modeling of traffic flows and service capacities. Performance measures at single nodes and the service capacities of tandem systems are explicitly bounded at the...
متن کاملA Stochastic Network Calculus
The issue of Quality of Service (QoS) performance analysis in packet switched networks has drawn a lot of attention in the networking community in recent years. There is a lot of work including an elegant theory under the name of network calculus focusing on analysis of deterministic worst case QoS performance bounds. In the meantime, other researchers have studied the stochastic QoS performanc...
متن کاملA Stochastic Network Calculus
The issue of Quality of Service (QoS) performance analysis in packet switching networkshas drawn a lot of attention in the networking community in recent years. There is a lot ofwork including an elegant theory under the name of network calculus focusing on analysisof deterministic worst case QoS performance bounds. In the meantime, other researchershave studied the stochastic Q...
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملOn Effectiveness of Backlog Bounds Using Stochastic Network Calculus in 802.11
Network calculus is a powerful methodology of characterizing queueing processes and has wide applications, but few works on applying it to 802.11 by far. In this paper, we take one of the first steps to analyze the backlog bounds of an 802.11 wireless LAN using stochastic network calculus. In particular, we want to address its effectiveness on bounding backlogs. We model a wireless node as a si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2013
ISSN: 0163-5999
DOI: 10.1145/2494232.2465746